#include "BinaryTree.h"

void test() {
	char a[] = "ABD##E#H##CF##G##";
	int n = strlen(a);
	int i = 0;
	BTNode* root = BinaryTreeCreate(a, n, &i);
	
	/*
	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");
	BinaryTreeLevelOrder(root);
	printf("\n");
	*/

	/*
	printf("%d\n",BinaryTreeSize(root));
	printf("%d\n",BinaryTreeLeafSize(root));
	printf("%d\n",BinaryTreeLevelKSize(root, 3));
	*/

	int num = BinaryTreeComplete(root);
	if (num == 1)
		printf("true\n");
	else
		printf("false\n");

	BinaryTreeDestory(&root);
}

int main() {
	test();
	return 0;
}